An Approach for Solving Traveling Salesman Problem
Authors
Abstract:
In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illustrated it with analytical examples and by computer programming. The proposed method builds on the initial solution of the traveling salesman problem (TSP) which is very simple, easy to understand and apply. Keywords: Traveling Salesman Problem, Hungarian Method, Optimal Solution, Computer Algorithm.
similar resources
An Effective Genetic Algorithm for Solving the Multiple Traveling Salesman Problem
The multiple traveling salesman problem (MTSP) involves scheduling m > 1 salesmen to visit a set of n > m nodes so that each node is visited exactly once. The objective is to minimize the total distance traveled by all the salesmen. The MTSP is an example of combinatorial optimization problems, and has a multiplicity of applications, mostly in the areas of routing and scheduling. In this paper,...
full textAN EFFICIENT CROSSOVER OPERATOR FOR TRAVELING SALESMAN PROBLEM
Crossover operator plays a crucial role in the efficiency of genetic algorithm (GA). Several crossover operators have been proposed for solving the travelling salesman problem (TSP) in the literature. These operators have paid less attention to the characteristics of the traveling salesman problem, and majority of these operators can only generate feasible solutions. In this paper, a crossover ...
full textA Multiagent Approach To Solving Dynamic Traveling Salesman Problem
A multi-agent approach to solving dynamic Traveling Salesman Problem (TSP) is presented. In the dynamic version of TSP cities can be dynamically added or removed. Proposed multi-agent approach is based on the Sensitive Stigmergic Agent System model refined with new type of messages between agents. The agents send messages every time a change occurs, for instance, when an agent observes that a c...
full textSolving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
full textSolving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
full textSolving Traveling Salesman Problem by Marker Method
In this paper we use marker method and propose a new mutation operator that selects the nearest neighbor among all near neighbors solving Traveling Salesman Problem.
full textMy Resources
Journal title
volume 3 issue None
pages 0- 0
publication date 2013-03
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023